Effects of Multi-Robot Team Formations on Distributed Area Coverage
نویسندگان
چکیده
This paper examines the problem of distributed coverage of an initially unknown environment using a multi-robot system. Specifically, focus is on a coverage technique for coordinating teams of multiple mobile robots that are deployed and maintained in a certain formation while covering the environment. The technique is analyzed theoretically and experimentally to verify its operation and performance within the Webots robot simulator, as well as on physical robots. Experimental results show that the described coverage technique with robot teams moving in formation can perform comparably with a technique where the robots move individually while covering the environment. The authors also quantify the effect of various parameters of the system, such as the size of the robot teams, the presence of localization, and wheel slip noise, as well as environment related features like the size of the environment and the presence of obstacles and walls on the performance of the area coverage operation. DOI: 10.4018/978-1-4666-2479-5.ch014
منابع مشابه
Robust Multi-robot Team Formations Using Weighted Voting Games
We consider the problem of distributed multi-robot team formation including the dynamic reconfiguration of robot teams after encountering obstacles. We describe a distributed robot team reconfiguration algorithm, DYN-REFORM, that uses a game-theoretic technique of team formation called weighted voting games(WVGs) along with a flocking-based formation control mechanism. DYNREFORM works without e...
متن کاملPerformance Analysis of a Repairable Robot Safety System with Standby, Imperfect Coverage and Reboot Delay
The present study deals with a robot safety system composed of standby robot units and inbuilt safety unit. When the main operative unit fails, it is replaced by the standby robot unit available in the system. The concept of reboot delay is also incorporated in this study according to which the robot unit is rebooted if it is not successfully recovered. The recovery and reboot times of failed u...
متن کاملDynamic Obstacle Avoidance by Distributed Algorithm based on Reinforcement Learning (RESEARCH NOTE)
In this paper we focus on the application of reinforcement learning to obstacle avoidance in dynamic Environments in wireless sensor networks. A distributed algorithm based on reinforcement learning is developed for sensor networks to guide mobile robot through the dynamic obstacles. The sensor network models the danger of the area under coverage as obstacles, and has the property of adoption o...
متن کاملCoverage Path Planning Using Mobile Robot Team Formations
The multi-robot coverage path-planning problem involves finding collision-free paths for a set of robots so that they can completely cover the surface of an environment. This problem is non-trivial as the geometry and location of obstacles in the environment is usually not known a priori by the robots, and they have to adapt their coverage path as they discover obstacles while moving in the env...
متن کاملMulti-Robot Coverage: A Bee Pheromone Signalling Approach
In this paper we propose BeePCo, a multi-robot coverage approach based on honeybee colony behaviour. Specifically, we propose a honeybee inspired pheromone signalling method that allows a team of robots to maximise the total area covered in an environment in a distributed manner. The effectiveness of the proposed algorithm is experimentally evaluated on two different scenarios: when network con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IJSIR
دوره 2 شماره
صفحات -
تاریخ انتشار 2011